منابع مشابه
Space Discretization for Efficient Human Navigation
There is a large body of research on motion control of legs in human models. However, they require specification of global paths in which to move. A method for automatically computing a global motion path for a human in 3D environment of obstacles is presented. Object space is discretized into a 3D grid of uniform cells and an optimal path is generated between two points as a discrete cell path...
متن کاملEfficient Discretization Scheduling In Multiple Dimensions
There is a tradeoff between speed and accuracy in fitness evaluations when various discretization sizes are used to estimate the fitness. This paper introduces discretization scheduling, which varies the size of the discretization within the GA, and compares this method to using a constant discretization. It will be shown that when scheduling the discretization, less computation time is used wi...
متن کاملEfficient Genetic Algorithms Using Discretization Scheduling
In many applications of genetic algorithms, there is a tradeoff between speed and accuracy in fitness evaluations when evaluations use numerical methods with varying discretization. In these types of applications, the cost and accuracy vary from discretization errors when implicit or explicit quadrature is used to estimate the function evaluations. This paper examines discretization scheduling,...
متن کاملEfficient Frontier of Utility and Conditional VaR
We study the efficient frontier problem of maximizing the expected utility of terminal wealth and minimizing the conditional VaR of the utility loss. We establish the existence of the optimal solution with the dual analysis and find the optimal value with the sequential penalty function and viscosity solution method.
متن کاملEfficient cache use for stencil operations on structured discretization grids
We derive tight bounds on the cache misses for evaluation of explicit stencil operators on structured grids. Our lower bound is based on the isoperimetrical property of the discrete octahedron. Our upper bound is based on a good surface to volume ratio of a parallelepiped spanned by a reduced basis of the interference lattice of a grid. Measurements show that our algorithm typically reduces the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Economics Letters
سال: 2021
ISSN: 0165-1765
DOI: 10.1016/j.econlet.2021.109872